Negation in Contextual Logic
نویسندگان
چکیده
This contribution discusses a formalization of the “negation of a concept”. The notion of “concept” has been successfully formalized in the early eighties and led to the theory of Formal Concept Analysis. Boole (1815-1864) developed a mathematical theory for human thought based on signs and classes. The formalization of the negation of concepts is needed in order to develop a mathematical theory of human thought based on “concept as a basic unit of thought”. Two approaches will be discussed: negation as a partial or as a full operation on concepts.
منابع مشابه
The Complexity of Contextual Abduction in Human Reasoning Tasks
In everyday life, it seems that when we observe something, then, while searching for explanations, we assume some explanation more plausible to others, simply because of our contextual background. Recently, a contextual reasoning approach has been presented, which takes into account this contextual background and allows us to specify context within the logic. This approach is embedded into the ...
متن کاملContextual hypotheses and semantics of logic programs
Logic programming has developed as a rich field, built over a logical substratum whose main constituent is a nonclassical form of negation, sometimes coexisting with classical negation. The field has seen the advent of a number of alternative semantics, with Kripke-Kleene semantics, the well founded semantics, the stable model semantics, and answer-set programming standing out as the most succe...
متن کاملContextual Abduction and its Complexity Issues
In everyday life, it seems that we prefer some explanations for an observation over others because of our contextual background knowledge. Reiter already tried to specify a mechanism within logic that allows us to avoid explicitly considering all exceptions in order to derive a conclusion w.r.t. the usual case. In a recent paper, a contextual reasoning approach has been presented, which takes t...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملOn negation: Pure local rules
This is an initial systematic study of the properties of negation from the point of view of abstract deductive systems. A unifying framework of multiple-conclusion consequence relations is adopted so as to allow us to explore symmetry in exposing and matching a great number of positive contextual sub-classical rules involving this logical constant —among others, well-known forms of proof by cas...
متن کامل